Foundations of Total Functional Data-Flow Programming

Foundations of Total Functional Data-Flow Programming

The field of declarative stream programming (discrete time, clocked synchronous, modular, datacentric) is divided between the data-flow graph paradigm favored by domain experts, and the functional reactive paradigm favored by academics. In this paper, we describe the foundations of a framework for unifying functional and data-flow styles that differs from FRP proper in significant ways: It is b...

Foundations of Functional Programming

ions are compiled to the command, which will push a closure onto the Stack. The closure will include the current Environment and will hold as a list of commands, from compilation: Applications are compiled to the command at compile time. Under the interpreted SECD machine, this work occurred at run time: We could add further instructions, say for conditionals. Let be replaced by or , depending ...

Domain-theoretic foundations of functional programming

Mathematical Foundations of Logic and Functional Programming

As an introduction, we give some examples of logic programs and the intended semantics of them. A logic program is simply a (not necessarily finite!) set of program clauses. That is, there is no particular ordering of the clauses as in the case, say, imperative programs: a program here is just a set of constraints, a set of logical formulas describing the world in which the programming environm...

Total Functional Programming

The driving idea of functional programming is to make programming more closely related to mathematics. A program in a functional language such as Haskell or Miranda consists of equations which are both computation rules and a basis for simple algebraic reasoning about the functions and data structures they define. The existing model of functional programming, although elegant and powerful, is c...